The Pacific Railway Debts

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The debts' clearing problem: a new approach

The debts’ clearing problem is about clearing all the debts in a group of n entities (e.g. persons, companies) using a minimal number of money transaction operations. In our previous works we studied the problem, gave a dynamic programming solution solving it and proved that it is NP-hard. In this paper we adapt the problem to dynamic graphs and give a data structure to solve it. Based on this ...

متن کامل

The Moral Obligations of Some Debts

If given the opportunity to reduce your debt, albeit at some financial risk, would you take it? Interviews and observations in two debt settlement firms show that debt settlement clients tend not to calculate financial risks in deciding which debts to try to settle. Rather, they treat their relationship with their creditor as a reciprocal and ongoing one. If the service provided by their credit...

متن کامل

Evolutionary solving of the debts' clearing problem

The debts’ clearing problem is about clearing all the debts in a group of n entities (persons, companies etc.) using a minimal number of money transaction operations. The problem is known to be NP-hard in the strong sense. As for many intractable problems, techniques from the field of artificial intelligence are useful in finding solutions close to optimum for large inputs. An evolutionary algo...

متن کامل

Medicare bad debts are you losing money?

Providers should adopt strategies to make sure that both their claimed and not yet claimed Medicare bad debts will be reimbursed. For periods going forward, providers that are not protected by the bad debt moratorium should make sure they have a bad debt policy in place that complies with CMS's current policies.

متن کامل

The Debts’ Clearing Problem’s Relation with Complexity Classes

The debts’ clearing problem is about clearing all the debts in a group of n entities (eg. persons, companies) using a minimal number of money transaction operations. In a previous paper we conjectured the problem to be NP-complete. In this paper we prove that it is NP-hard in the strong sense and also NP-easy. We also show the same results for a restricted version of the problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Political Economy

سال: 1894

ISSN: 0022-3808,1537-534X

DOI: 10.1086/250228